Strong consistency of sample path derivative estimates
نویسندگان
چکیده
منابع مشابه
Consistency of Sample Estimates of Risk Averse Stochastic Programs
In this paper we study asymptotic consistency of law invariant convex risk measures and the corresponding risk averse stochastic programming problems for independent identically distributed data. Under mild regularity conditions we prove a Law of Large Numbers and epiconvergence of the corresponding statistical estimators. This can be applied in a straightforward way to establishing convergence...
متن کاملStrong consistency of least-squares estimates in regression models.
A general theorem on the limiting behavior of certain weighted sums of i.i.d. random variables is obtained. This theorem is then applied to prove the strong consistency of least-squares estimates in linear and nonlinear regression models with i.i.d. errors under minimal assumptions on the design and weak moment conditions on the errors.
متن کاملStrong Universal Consistency of Smooth Kernel Regression Estimates
The paper deals with kernel estimates of Nadaraya-Watson type for a regression function with square integrable response variable. For usual bandwidth sequences and smooth nonnegative kernels, e.g., Gaussian and quartic kernels, strong L2-consistency is shown without any further condition on the underlying distribution. The proof uses a Tauberian theorem for Ces~ro summability. Let X be a d-dime...
متن کاملPath Consistency by Dual Consistency
Dual Consistency (DC) is a property of Constraint Networks (CNs) which is equivalent, in its unrestricted form, to Path Consistency (PC). The principle is to perform successive singleton checks (i.e. enforcing arc consistency after the assignment of a value to a variable) in order to identify inconsistent pairs of values, until a fixpoint is reached. In this paper, we propose two new algorithms...
متن کاملFrom Restricted Path Consistency to Max-Restricted Path Consistency
There is no need to show the importance of the ltering tech niques to solve constraint satisfaction problems i e to nd values for problem variables subject to constraints that specify which combinations of values are consistent They can be used during a preprocessing step to remove once and for all some local inconsistencies or during the search to e ciently prune the search tree Recently in a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics Letters
سال: 1990
ISSN: 0893-9659
DOI: 10.1016/0893-9659(90)90047-f